package com.solming.leetcode.question;

//给你单链表的头节点 head ，请你反转链表，并返回反转后的链表。
public class ReverseList206 {

    public ListNode reverseList(ListNode head) {
        ListNode pre = null;
        while (head != null) {
            ListNode next = head.next;
            //这里就是它原来的自己
            head.next = pre;
            pre = head;
            head = next;

        }
        return pre;
    }


}
